package com.leecode.rotateMinNumber;

public class Solution {

    public static void main(String[] args) {
        Solution solution = new Solution();
        int[] arr = new int[]{3,4,5,1,2};

        int result = solution.minArray(arr);
        System.out.println(result);
    }

    public int minArray(int[] numbers) {
        int min = numbers[0];

        for (int number : numbers) {
            if(min > number){
                min = number;
            }
        }
        return min;
    }
}
